Literate Proving: Presenting and Documenting Formal Proofs
نویسندگان
چکیده
Literate proving is the analogue for literate programming in the mathematical realm. That is, the goal of literate proving is to produce clear expositions of formal mathematics that could even be enjoyable for people to read whilst remaining faithful representations of the actual proofs. This paper describes maze, a generic literate proving system. Authors markup formal proof files, such as Mizar files, with arbitary XML and use maze to obtain the selected extracts and transform them for presentation, e.g. as LTEX. To aid its use, maze has built in transformations that include pretty printing and proof sketching for inclusion in LTEX documents. These transformations challenge the concept of faithfulness in literate proving but it is argued that this should be a distinguishing feature of literate proving from literate programming.
منابع مشابه
Quranic way of presenting proofs for God`s existence
Regardless of the view of those philosophers like Plantinga who see no need in any proof for the existence of God, scholars have presented four views on Quranic way of proving the existence of God including demonstration, awakening, implication and clear demonstration. Describing and criticizing the views in detail, the author has viewed differently. God has regarded the level of the addressee`...
متن کاملStructured Presentation of Formal Proofs Experiments with Isabelle
The intelligible presentation of formal proofs is usually not attempted because of their technical detail. This formal noise hides the line of reasoning that can be followed and understood by humans. We are investigating methodologies and machine support for presenting formal proofs in an intelligible and structured manner while keeping them amenable to a check by a machine or an interactive de...
متن کاملFormalization and 'Literate' Programming
The ‘literate’ programming model is extended to include a concept of mechanical transformation. A prototype tool, FLP (Formal Literate Programming tool), has been developed which uses this extended ‘literate’ programming model in both a formal program proof setting, and within a formal (refinement) program development setting. In both settings, FLP provides history, access to tools, and an easy...
متن کاملTools for the implementation of argumentation models
The structured approach to argumentation has seen a surge of models, introducing a multitude of ways to deal with the formalisation of arguments. However, while the development of the mathematical models have flourished, the actual implementations and development of methods for implementation of these models have been lagging behind. This paper attempts to alleviate this problem by providing me...
متن کاملWriting Literate Proofs with XML Tools
Both mechanical proof scripts and programs benefit from documentation and modularity. Designed to be an industrial-strength theorem prover, ACL2 provides powerful support for both of these. The standard distribution includes hundreds of pages of documentation that are automatically generated from function doc-strings in the source code. However, it is still difficult to write easily understanda...
متن کامل